Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
851	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Complexity classes Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Knapsack problem Optimization problem Dynamic programming Theoretical computer science Computational complexity theory Applied mathematics
852	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
853	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Complexity classes Operations research Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Polynomial-time approximation scheme Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
854	Chapter 1: An Introduction to Approximation Algorithms (cp. Williamson & Shmoys, Chapter 1) 4 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Mathematical optimization Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Vertex cover NP-complete Theoretical computer science Computational complexity theory Applied mathematics
855	TSP with Bounded Metrics Lars Engebretsen1,? and Marek Karpinski2,?? 1 Department of Numerical Analysis and Computer Science Royal Institute of Technology Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2006-02-09 12:47:04 Complexity classes NP-complete problems Operations research Approximation algorithms Travelling salesman problem Combinatorial optimization APX Optimization problem PCP theorem Theoretical computer science Computational complexity theory Applied mathematics
856	A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report) Joseph Y. Halpern IBM Almaden Research Center Add to Reading List Source URL: www.markrtuttle.com Language: English - Date: 2007-04-26 00:00:00 Probabilistic complexity theory Cryptographic protocols Complexity classes Interactive proof system Quantum complexity theory IP Zero-knowledge proof Soundness Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
857	On Approximation Lower Bounds for TSP with Bounded Metrics Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-02-27 08:46:45 Complexity classes NP-complete problems Operations research Travelling salesman problem Approximation algorithm Optimization problem PCP theorem NP-complete APX Theoretical computer science Computational complexity theory Applied mathematics
858	MERLIN A polynomial solution for the Traveling Salesman Problem Dr. Joachim Mertz, [removed] Add to Reading List Source URL: www.merlins-world.de Language: English - Date: 2007-04-13 17:27:56 Complexity classes Operations research Mathematical optimization NP-complete problems Travelling salesman problem NP P versus NP problem Linear programming Combinatorial optimization Theoretical computer science Computational complexity theory Applied mathematics
859	Curriculum Vitae Marek Karpinski Dept. of Computer Science and Hausdorff Center for Mathematics University of Bonn Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-27 06:27:04 Complexity classes Approximation algorithms Marek Karpinski Computational problems APX Combinatorial optimization Polynomial-time approximation scheme NP-complete problems Time complexity Theoretical computer science Computational complexity theory Applied mathematics
860	in Artificial Life VIII, Standish, Abbass, Bedau (eds)(MIT Press[removed]pp 9–14 1 Complexity Classes in Three-dimensional Gravitational Agents Jean-Claude Heudin Add to Reading List Source URL: www.alife.org Language: English - Date: 2013-01-14 08:20:35 Chaos theory Structure Systems science Complex systems theory Cybernetics Agent-based model Dynamical system Emergence Cellular automaton Systems theory Science Systems

UPDATE